How Unfair can Weighted Fair Queuing be?

نویسندگان

  • Gonçalo Quadros
  • Antonio Alves
  • Edmundo Monteiro
  • Fernando Boavida
چکیده

This paper presents a study carried out on a Weighted Fair Queuing implementation for Unix routers the WFQ implementation of the ALTQ project. It shows the WFQ/ALTQ weaknesses and explains why we cannot expect an interesting behavior from a system using such a

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Analysis of Scheduling Disciplines Using OPNET

Resource allocation mechanisms require that routers execute a scheduling discipline that manages buffering of packets during waiting time. Various scheduling algorithms may be implemented to govern packet transmission and control packet loss. Volume of UDP traffic is dramatically increasing due to the widely used P2P and steaming technologies. Unlike TCP, UDP protocol does not have mechanism to...

متن کامل

Few buffers suffice: Explaining why and how crossbars with weighted fair queuing converge to weighted max-min fairness

We explain why and how a crossbar switch with weighted fair queues (a deterministic device) converges to weighted max-min fair rates of service. Based on a plausible technical hypothesis we prove that a small mean number of buffers suffices to this end. WMMF-rates comprise the unique Nash equilibrium of a natural switching game—a fact that supports further their use.

متن کامل

A Simulation Study of Flow-Based Scheduling Algorithms

This paper presents a set of simulation studies for comparing the performance of several flow-based scheduling algorithms, namely Weighted Fair Queuing, Self-Clock Fair Queuing, Start-Time Fair Queuing, Virtual Clock, Worst-case Fair Weighted Fair Queuing and Worstcase Fair Weighted Fair Queuing-plus. These algorithms are being considered for IP networks supporting Quality of Service (QoS).

متن کامل

Impact of hybrid queuing disciplines on the VoIP traffic delay

The paper presents different combinations of queuing methods and their impact on the VoIP traffic delay within the network. In our experiment we combined three of the most useful queuing methods where we put together priority queuing (PQ) with class-based weighted fair queuing (CBWFQ), custom queuing (CQ) with CBWFQ and weighted fair queuing (WFQ) with CBWFQ. Each hybrid method is compared with...

متن کامل

The Effects of Different Congestion Management Algorithms over Voip Performance

This paper presents one of the features of DS (Differentiated Services) architecture, namely the queuing or congestion management. Packets can be placed into separate buffer queues, on the basis of the DS value. Several forwarding policies can be used to favor high priority packets in different ways. The major reason for queuing is that the router must hold the packet in its memory while the ou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000